Matching Large Xml Schemas 2004
ثبت نشده
چکیده
Schema integration, Data matching, XML schema, Heterogeneous data (20) Rahm E., Do H, Massmann S. (2004) "Matching large XML schemas", ACM. An XML schema provides standards and rules for the structure of a given XML document. Stefani_/artist_ _year_2004_/year_ _genre_pop_/genre_ _description_ This companies and market places) exchange increasingly large amounts of data. XSLT will use the match attribute to relate XML element nodes.
منابع مشابه
Automating XML document Transformations: A conceptual modelling based approach
The growing use of XML mark-up language has made a large amount of heterogeneous XML documents widely available. As the number of applications that utilize heterogeneous XML documents grows, the importance of XML documents transformations increases greatly. A serious obstacle for translating directly between two XML documents, using languages like XSLT, is that a mapping between the two XML rep...
متن کاملMatching of XML Schemas and Relational Schemas
XML is widely used for data exchange between relational databases. Generic exchange tools are based on mappings between the elements of both schemas. Despite the benefits of using generic tools, the manual definition of the mappings can become a time consuming and error-prone task. Given this scenario we propose algorithms for the automatic matching of XML schemas(DTDs) and relational schemas. ...
متن کاملAn Experiment on the Matching and Reuse of XML Schemas
XML Schema is becoming an indispensable component in developing web applications. With its widespread adoption and its web accessibility, XML Schema reuse is becoming imperative. To support XML Schema reuse, the first step is to develop mechanism to search for relevant XML Schemas over the web. This paper describes a XML Schema matching system that compares two XML Schemas. Our matching system ...
متن کاملImproving Real World Schema Matching with Decomposition Process
This paper tends to provide an answer to a difficult problem: Matching large XML schemas. Scalable Matching acquires a long execution time other than decreasing the quality of matches. In this paper, we propose an XML schema decomposition approach as a solution for large schema matching problem. The presented approach identifies the common structures between and within XML schemas, and decompos...
متن کاملApproximate Common Structures in XML Schema Matching1
This paper describes a matching algorithm that can find accurate matches and scales to large XML Schemas with hundreds of nodes. We model XML Schemas as labeled, unordered and rooted trees, and turn the schema matching problem into a tree matching problem. We develop a tree matching algorithm based on the concept of Approximate Common Structures. Compared with the tree edit-distance algorithm a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015